Efficient uncertainty minimization for fuzzy spectral clustering
نویسندگان
چکیده
منابع مشابه
Efficient uncertainty minimization for spectral macrostate data clustering
Spectral clustering, which uses the global information embedded in eigenvectors of an interitem relationship matrix, can outperform traditional approaches such as k-means and hierarchical clustering. Spectral hierarchical bipartitioning is well-understood, but spectral multipartitioning remains an interesting research topic. Korenblum and Shalloway [Phys. Rev. E 67, 056704 (2003)] used an analo...
متن کاملPractical Uncertainty Minimization for Spectral Macrostate Data Clustering
Spectral clustering, which uses the global information embedded in eigenvectors of an inter-item relation matrix, can outperform traditional approaches such as k-means and hierarchical clustering. Spectral hierarchical bipartitioning is well-understood, but spectral multipartitioning remains an interesting research topic. Korenblum and Shalloway [Phys. Rev. E 67, 056704 (2003)] used an analogy ...
متن کاملEfficient eigen-updating for spectral graph clustering
Partitioning a graph into groups of vertices such that those within each group are more densely connected than vertices assigned to different groups, known as graph clustering, is often used to gain insight into the organisation of large scale networks and for visualisation purposes. Whereas a large number of dedicated techniques have been recently proposed for static graphs, the design of onli...
متن کاملEvolving Fuzzy Prototypes for Efficient Data Clustering
number of prototypes used to represent each class, the position of each prototype within its class and the membership function associated with each prototype. This paper proposes a novel, evolutionary approach to data clustering and classification which overcomes many of the limitations of traditional systems. The approach rests on the optimisation of both the number and positions of fuzzy prot...
متن کاملEfficient Clustering with Fuzzy Ants
In the past decade, various clustering algorithms based on the behaviour of real ants were proposed. The main advantage of these algorithms lies in the fact that no additional information, such as an initial partitioning of the data or the number of clusters, is needed. In this paper we show how the combination of the ant-based approach with fuzzy rules leads to an algorithm which is conceptual...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2009
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.80.056705